Polynomial bounds in polynomial rings over fields
نویسندگان
چکیده
منابع مشابه
Bounds in Polynomial Rings over Artinian Local Rings
Let R be a (mixed characteristic) Artinian local ring of length l and let X be an n-tuple of variables. This paper provides bounds over the ring R[X] on the degrees of the output of several algebraic constructions in terms of l, n and the degrees of the input. For instance, if I is an ideal in R[X] generated by polynomials gi of degree at most d and if f is a polynomial of degree at most d belo...
متن کاملPolynomial Rings over Pseudovaluation Rings
Let R be a ring. Let σ be an automorphism of R. We define a σ-divided ring and prove the following. (1) Let R be a commutative pseudovaluation ring such that x ∈ P for any P ∈ Spec(R[x,σ]) . Then R[x,σ] is also a pseudovaluation ring. (2) Let R be a σ-divided ring such that x ∈ P for any P ∈ Spec(R[x,σ]). Then R[x,σ] is also a σ-divided ring. Let now R be a commutative Noetherian Q-algebra (Q i...
متن کاملGray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملFactoring in Skew-Polynomial Rings over Finite Fields
Efficient algorithms are presented for factoring polynomials in the skew-polynomial ring F[x; σ], a non-commutative generalization of the usual ring of polynomials F[x], where F is a finite field and σ: F → F is an automorphism (iterated Frobenius map). Applications include fast functional decomposition algorithms for a class of polynomials in F[x] whose decompositions are “wild” and previously...
متن کاملBounds and Definability in Polynomial Rings
We study questions around the existence of bounds and the dependence on parameters for linear-algebraic problems in polynomial rings over rings of an arithmetic flavor. In particular, we show that the module of syzygies of polynomials f1, . . . , fn ∈ R[X1, . . . , XN ] with coefficients in a Prüfer domain R can be generated by elements whose degrees are bounded by a number only depending on N ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1989
ISSN: 0021-8693
DOI: 10.1016/0021-8693(89)90299-8